Computation of Gutman index of some cactus chains
نویسندگان
چکیده
منابع مشابه
Bounds on Gutman Index
The Gutman index (also known as Schultz index of the second kind) of a graph G is defined as Gut(G) = ∑ u,v∈V (G) d(u)d(v)d(u, v). We show that among all graphs on n vertices, the star graph Sn has minimal Gutman index. In addition, we present upper and lower bounds on Gutman index for graphs with minimal and graphs with maximal Gutman index. Corresponding author Supported by project 1M0545 of ...
متن کاملsome properties of fuzzy hilbert spaces and norm of operators
in this thesis, at first we investigate the bounded inverse theorem on fuzzy normed linear spaces and study the set of all compact operators on these spaces. then we introduce the notions of fuzzy boundedness and investigate a new norm operators and the relationship between continuity and boundedness. and, we show that the space of all fuzzy bounded operators is complete. finally, we define...
15 صفحه اولThe Multiplicative Versions of the Reciprocal Degree Distance and Reciprocal Gutman Index of Some Graph Products
In this paper, we provide exact value of the multiplicative version of the reciprocal degree distance and the multiplicative version of the reciprocal Gutman index of Cartesian product of complete graphs. Also, we establish sharp upper bounds for the multiplicative version of the reciprocal degree distance and multiplicative version of the reciprocal Gutman index of strong product of graphs.
متن کاملSharp Upper bounds for Multiplicative Version of Degree Distance and Multiplicative Version of Gutman Index of Some Products of Graphs
In $1994,$ degree distance of a graph was introduced by Dobrynin, Kochetova and Gutman. And Gutman proposed the Gutman index of a graph in $1994.$ In this paper, we introduce the concepts of multiplicative version of degree distance and the multiplicative version of Gutman index of a graph. We find the sharp upper bound for the multiplicative version of degree distance and multiplicative ver...
متن کاملCentdian Computation in Cactus Graphs
This paper focuses on the centdian problem in a cactus network where a cactus network is a connected undirected graph, and any two simple cycles in the graph have at most one node in common. The cactus network has important applications for wireless sensor networks when a tree topology might not be applicable and for extensions to the ring architecture. The centdian criterion represents a conve...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Electronic Journal of Graph Theory and Applications
سال: 2018
ISSN: 2338-2287
DOI: 10.5614/ejgta.2018.6.1.10